Probabilistic Time

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Adaptive Computation Time

We present a probabilistic model with discrete latent variables that control the computation time in deep learning models such as ResNets and LSTMs. A prior on the latent variables expresses the preference for faster computation. The amount of computation for an input is determined via amortized maximum a posteriori (MAP) inference. MAP inference is performed using a novel stochastic variationa...

متن کامل

Continuous-Time Probabilistic KLAIM

The design of languages supporting network programming is a necessary step towards the formalisation of distributed and mobile computing. The existence of an abstract semantic framework constitutes the basis for a formal analysis of such systems. The KLAIM paradigm [5] provides such a semantic framework by introducing basic concepts and primitives addressing the key aspects of the coordination ...

متن کامل

Probabilistic Time Petri Nets

We introduce a new model for the design of concurrent stochastic real-time systems. Probabilistic time Petri nets (PTPN) are an extension of time Petri nets in which the output of tokens is randomised. Such a design allows us to elegantly solve the hard problem of combining probabilities and concurrency. This model further benefits from the concision and expressive power of Petri nets. Furtherm...

متن کامل

On Probabilistic Time versus Alternating Time

We prove several new results regarding the relationship between probabilistic time, BPTime (t), and alternating time, ΣO(1)Time (t). Our main results are the following: 1. We prove that BPTime (t) ⊆ Σ3Time (t · poly log t). Previous results show that BPTime (t) ⊆ Σ2Time ( t2 · log t ) (Sipser and Gács, STOC ’83; Lautemann, IPL ’83) and BPTime (t) ⊆ ΣcTime (t) for a large constant c > 3 (Ajtai, ...

متن کامل

Probabilistic Alternating-Time Temporal Logic

A probabilistic variant of ATL∗ logic is proposed to work with multi-player games of incomplete information and synchronous perfect recall. The semantics of the logic is settled over probabilistic interpreted system and partially observed probabilistic concurrent game structure. While unexpectedly, the model checking problem is in general undecidable even for singlegroup fragment, we find a fra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations of Physics

سال: 2012

ISSN: 0015-9018,1572-9516

DOI: 10.1007/s10701-012-9675-3